Sigact News Complexity Theory Column 32 Introduction to Complexity Theory Column ?? Guest Column: Complexity of Svp | a Reader's Digest 1
نویسنده
چکیده
We present high-level technical summaries of ve recent results on the computational complexity of the shortest lattice vector problem.
منابع مشابه
Sigact News Complexity Theory Column 52 Bovet and Crescenzi's Complexity Textbook Is Again Available Guest Column: Recent Work on Hierarchies for Semantic Classes
We survey time hierarchies, with an emphasis on recent work on hierarchies for semantic classes.
متن کاملSigact News Complexity Theory Column 25 Introduction to Complexity Theory Column 25
Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of “listdecoding” for error-correcting codes. In this survey we describe the list-decoding problem, the algorithms that have been deve...
متن کاملSigact News Complexity Theory Column 6 Introduction to Complexity Theory Column 6 Guest Column: Semi-membership Algorithms: Some Recent Advances 1
I just attended the 9th Structure in Complexity Theory Conference, which was in Amsterdam this year. 100% of the rst three papers in the proceedings ;?) were devoted to the study of semi-membership algorithms! In fact, during the last half-decade, there has been a marked surge of interest in semi-membership algorithms. The article below surveys some of the recent results from this research area...
متن کاملGuest Column: Progress in Descriptive Complexity
The raison d’être of descriptive complexity is the following The Computational Complexity of checking if an input has a property can be understood as the Logical Complexity needed to describe the property. In this guest column I give an overview of descriptive complexity, and survey some current progress and directions. 1 c © Neil Immerman, 2005. Dept. of Computer Science, UMass, Amherst, MA 01...
متن کاملComplexity Theory Column 48
Here is a real gift to the field from David Johnson: After a thirteen year intermission, David is restarting his NP-completeness column. His column will now appear about twice yearly in ACM Transactions on Algorithms. Welcome back David, and thanks! And for those for whom a diet of two per year won’t do, meals past can be found at http://www.research.att.com/ ̃dsj/columns.html. As to the Complex...
متن کامل